On the Existence of Global Tchebychev Nets

Tchebychev nets on spheres

A Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier

This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...

The existence of global attractor for a Cahn-Hilliard/Allen-Cahn‎ ‎equation

In this paper, we consider a Cahn-Hillard/Allen-Cahn equation. By using the semigroup and the classical existence theorem of global attractors, we give the existence of the global attractor in H^k(0

Selectivity of multifilament trammel nets of different mesh sizes on the red mullet (Mullus barbatus L., 1758) in Western Mediterranean, Turkey

Three mesh sizes of multiflament trammel nets (22 mm, 24 mm, and 26 mm) were used in Finike bay for red mullet (Mullus barbatus L., 1758). The sampling program was arranged during February to May 2012. Holt (1963) method was used for selectivity of trammel nets. Red mullet was the dominant species in 22 mm mesh size at 52.86%, followed by 25.7% with the 24 mm net and 21.43% with the 26 mm net. ...

Real roots of univariate polynomials and straight line programs

We give a new proof of the NP-hardness of deciding the existence of real roots of an integer univariate polynomial encoded by a straight line program based on certain properties of the Tchebychev polynomials. These techniques allow us to prove some new NP-hardness results related to real root approximation for polynomials given by straight line programs.